Data Storage Interpretation of Labeled Modal Logic
نویسندگان
چکیده
We introduce reference structures { a basic mathematical model of a data organization capable to store and utilize information about its addresses. A propositional labeled modal language is used as a speciication and programming language for reference structures; the satissability algorithm for modal language gives a method of building and optimizing reference structures satisfying a given formula. Corresponding labeled modal logics are presented, supplied with cut free axiomatizations, completeness and decidability theorems are proved. Initialization of typed variables in some programming languages is presented as an example of a reference structure building.
منابع مشابه
Suhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملLinear Logic as a Logic of Computations
The question at issue is to develop a computational interpretation of Linear Logic [S] and to establish exactly its expressive power. We follow the bottom-up approach. This involves starting with the simplest of the systems we are interested in, and then expanding them step-by-step. We begin with the !-Horn fragment of Linear Logic, which uses only positive literals, the linear implication -, t...
متن کاملFocused Labeled Proof Systems for Modal Logic
Focused proofs are sequent calculus proofs that group inference rules into alternating negative and positive phases. These phases can then be used to define macro-level inference rules from Gentzen’s original and tiny introduction and structural rules. We show here that the inference rules of labeled proof systems for modal logics can similarly be described as pairs of such negative and positiv...
متن کاملThe Equivalence of Game and Denotational Semantics for the Probabilistic mu-Calculus
The modal μ-calculus Lμ [7] is a very expressive logic obtained by extending classical propositional modal logic with least and greatest fixed point operators. The logic Lμ has been extensively studied as it provides a very powerful tool for expressing properties of labeled transition systems [14]. Encodings of many important temporal logics such as LTL, CTL and CTL∗ into Lμ [1], provided evide...
متن کاملAxiomatizing Propositional Dependence Logics
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 78 شماره
صفحات -
تاریخ انتشار 1996